A Scalable Parallel Algorithm for Multiple Objective Linear Programs

This paper presents an ADBASE-based parallel algorithm for solving multiple objective linear programs (MOLPs). Job balance, speedup and scalability are of primary interest in evaluating e ciency of the new algorithm. Implementation results on Intel iPSC/2 and Paragon multiprocessors show that the algorithm signi cantly speeds up the process of solving MOLPs, which is understood as generating all or some e cient extreme points and unbounded e cient edges. The algorithm gives specially good results for large and very large problems. Motivation and justi cation for solving such large MOLPs are also included. Department of Mathematical Sciences, Clemson University, Clemson, SC 29634, U.S.A. ([email protected]). Research supported in part by the National Science Foundation under contract DMS-9308605. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA 23665, U.S.A. On leave from Department of Mathematical Sciences, Clemson University, Clemson, SC 29634, ([email protected]). Research supported by the National Aeronautics and Space Administration under NASA Contract No. NAS1-19480.